A characterization of time complexity by simple loop programs
نویسندگان
چکیده
منابع مشابه
A Complexity Analysis for Simple Generic Programs
The C++ Standard Template Library (STL) provides generic, high-performance algorithms and data types. STL also defines performance guarantees, but it is left as a non-trivial task to the library user to choose appropriate algorithms and data types for a particular problem. In the present paper, we describe an analysis to aid library users in selecting types for use in a generic programs. The an...
متن کاملthe effects of time planning and task complexity on accuracy of narrative task performance
هدف اصلی این تحقیق بررسی تاثیر برنامه ریزی زمانی، هم چنین افزایش میزان پیچیدگی تکالیف در نظر گرفته شده بصورت همزمان، بر دقت و صحت و پیچیدگی عملکرد نوشتاری زبان آموزان می باشد. بدین منظور، 50 نفر از دانش آموزان دختر در رده ی سنی 16 الی 18 سال به عنوان شرکت کنندگان در این زمینه ی تحقیق در نظر گرفته شدند و به دو گروه آزمایشی و کنترل بصورت اتفاقی تقسیم شدند. اعضای گروه آزمایشی هر دو تکلیف ساده و پی...
Time complexity of concurrent programs
We study the problem of automatically computing the time complexity of concurrent object-oriented programs. To determine this complexity we use intermediate abstract descriptions that record relevant information for the time analysis (cost of statements, creations of objects, and concurrent operations), called behavioural types. Then, we define a translation function that takes behavioural type...
متن کاملCharacterization of Termination for Linear Loop Programs
We present necessary and sufficient conditions for the termination of linear homogeneous programs. We also develop a complete method to check termination for this class of programs. Our complete characterization of termination for such programs is based on linear algebraic methods. We reduce the verification of the termination problem to checking the orthogonality of a well determined vector sp...
متن کاملCharacterization of Locality in Loop-Parallel Programs
Data locality is one of the most important characteristics of programs. Its study has signi cant in uence on the future development of architectures and compilers. Shared-memory multiprocessor (SMP) machines and their applications have become widely available, but there are few studies in the classi cation of data locality in parallel programs. Most studies have focused on temporal and spatial ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1980
ISSN: 0022-0000
DOI: 10.1016/0022-0000(80)90001-x